Search for: All records

Analog Ising machines (IMs) occupy an increasingly prominent area of computer architecture research, offering high-quality, low-latency, and low-energy solutions to intractable computing tasks; however, IMs have a fixed capacity, with little to no utility in out-of-capacity problems. Previous works have proposed parallel, multi-IM architectures to circumvent this limitation [A. Sharma, , in , ISCA ’22 (Association for Computing Machinery, New York, NY, USA, 2022), p. 508; R. Santos, , Enhancing quantum annealing via entanglement distribution, ArXiv:2212.02465]. In this work, we theoretically and numerically investigate trade-offs in parallel IM networks to guide researchers in this burgeoning field. We propose formal models of parallel IM execution models, and we then provide theoretical guarantees for probabilistic convergence. Numerical experiments illustrate our findings and provide empirical insights into the high- and low-synchronization-frequency regimes. We also provide practical heuristics for parameter and model selection, informed by our theoretical and numerical findings. 

Abstract With the slowdown of improvement in conventional von Neumann systems, increasing attention is paid to novel paradigms such as Ising machines. They have very different approach to solving combinatorial optimization problems. Ising machines have shown great potential in solving binary optimization problems like MaxCut. In this paper, we present an analysis of these systems in boolean satisfiability (SAT) problems. We demonstrate that, in the case of 3-SAT, a basic architecture fails to produce meaningful acceleration, largely due to the relentless progress made in conventional SAT solvers. Nevertheless, careful analysis attributes part of the failure to the lack of two important components: cubic interactions and efficient randomization heuristics. To overcome these limitations, we add proper architectural support for cubic interaction on a state-of-the-art Ising machine. More importantly, we propose a novel semantic-aware annealing schedule that makes the search-space navigation much more efficient than existing annealing heuristics. Using numerical simulations, we show that such an “Augmented” Ising Machine for SAT is projected to outperform state-of-the-art software-based, GPU-based and conventional hardware SAT solvers by orders of magnitude.